A First-Order Isomorphism Theorem
نویسندگان
چکیده
We show that for most complexity classes of interest, all sets complete under rstorder projections (fops) are isomorphic under rst-order isomorphisms. That is, a very restricted version of the Berman-Hartmanis Conjecture holds. Since \natural" complete problems seem to stay complete via fops, this indicates that up to rst-order isomorphism there is only one \natural" complete problem for each \nice" complexity class.
منابع مشابه
A generalization of Martindale's theorem to $(alpha, beta)-$homomorphism
Martindale proved that under some conditions every multiplicative isomorphism between two rings is additive. In this paper, we extend this theorem to a larger class of mappings and conclude that every multiplicative $(alpha, beta)-$derivation is additive.
متن کاملThe First Isomorphism Theorem and Other Properties of Rings
Different properties of rings and fields are discussed. We introduce ring homomorphisms, their kernels and images, and prove the First Isomorphism Theorem, namely that for a homomorphism f : R −→ S we have R/ker(f) ∼= Im(f). Then we define prime and irreducible elements and show that every principal ideal domain is factorial. Finally we show that polynomial rings over fields are Euclidean and h...
متن کاملOn generalized fuzzy numbers
This paper first improves Chen and Hsieh’s definition of generalized fuzzy numbers, which makes it the generalization of definition of fuzzy numbers. Secondly, in terms of the generalized fuzzy numbers set, we introduce two different kinds of orders and arithmetic operations and metrics based on the λ-cutting sets or generalized λ-cutting sets, so that the generalized fuzzy numbers are integrat...
متن کاملVaught ’ s Never Two Theorem Bachelor
This bachelor thesis provides a short overview of some major results in model theory concerning the spectrum function I(T, κ), where T is a firstorder theory and κ is a cardinal. In short, I(T, κ) tells us how many models of cardinality κ T has up to isomorphism. After summarising some basic definitions and results of elementary predicate logic, we turn our attention to types, both from a model...
متن کاملThe First-Order Isomorphism Theorem
For any class C und closed under NC reductions, it is shown that all sets complete for C under first-order (equivalently, Dlogtimeuniform AC) reductions are isomorphic under first-order computable
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Comput.
دوره 26 شماره
صفحات -
تاریخ انتشار 1993